A strategy for array management in local memory

A strategy for array management in local memory

Source :

• Mathematical Programming [ 0025-5610 ] ; 1994-01-01.

English descriptors

• Teeft :
  • Algorithm, Analytical model, Approximate window, Approximate windows, Approximation, Approximation window, Arbitrary point, Array, Array element, Array elements, Array management, Atomic dependence graph, Basic idea, Best solution, Block sizes, Cache, Classical knapsack problem, Code generation process, Coherence, Coherence constraints, Complex behavior, Computation, Constant shape, Convex hull, Corresponding window, Corresponding windows, Data accesses, Data dependencies, Data locality, Data locality optimization, Data transfers, Dependence graph, Dependency, Different occurrences, Distinct elements, Dominant window, Eisenbeis, Exact reference windows, Execution order, Extreme points, First case, First problem, General results, General structure, Geometric properties, Geometrical framework, Global strategy, Hyperplane, Innermost, Innermost loop, Innermost loops, Input dependence, Integer, Integer coordinates, Integer points, International conference, Iteration, Iteration space, Iteration vector, Knapsack, Knapsack problem, Large number, Last iteration, Limited size, Linear function, Linear references, Loading strategy, Local memories, Local memory, Local memory management, Local memory management strategy, Local memory size, Local memory space, Locality, Locality properties, Loop, Loop body, Loop bounds, Loop execution, Loop interchange, Loop restructuring, Loop reversal, Loop transformations, Main memory, Main memory accesses, Main result, Management problem, Management strategy, Memory locations, Memory management, Memory references, Memory space, Multiple copies, Next section, Optimization, Optimized code, Other hand, Outer loop, Outermost loops, Parallelepiped, Parallelization, Previous example, Previous section, Previous studies, Program transformation, Rational interval, Reference window, Reference windows, Referenced, Rice university, Same memory location, Second case, Section details, Simple case, Small example, Spatial locality, Special cases, Spot contention, Standard polynomial algorithms, Submodule span, Subset, Such cases, Technical report, Temporary array, Theoretical point, Time step, Time steps, Timing function, Total number, Tradeoff, Uniprocessor case, Vector form, Vector length, Vectorization, Window approximation, Window approximations, Window characterization, Window computation, Window size, Window size computation, Window sizes.

Abstract

• https://api.istex.fr/ark:/67375/1BB-8LHSZTFV-1/fulltext.pdf

Affiliations:

• France
• Région Bretagne, Île-de-France
• Le Chesnay, Rennes

Links toward previous steps (curation, corpus...)

• to stream Istex, to step Corpus: 000C28
• to stream Istex, to step Curation: 000C28
• to stream Istex, to step Checkpoint: 000C16
• to stream Main, to step Merge: 001F27
• to stream Main, to step Curation: 001E45
• to stream Main, to step Exploration: 001E45
• to stream France, to step Extraction: 000298

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Sante/explor/H2N2V1/Data/France/Analysis

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000298 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000298 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Sante
   |area=    H2N2V1
   |flux=    France
   |étape=   Analysis
   |type=    RBID
   |clé=     ISTEX:4BE0B51D8EED8EFB43D01F7DAD47DF902805275D
   |texte=   A strategy for array management in local memory
}}

This area was generated with Dilib version V0.6.33. Data generation: Tue Apr 14 19:59:40 2020. Site generation: Thu Mar 25 15:38:26 2021